Attractors and Subshifts of Finite Type of ECA 41

نویسندگان

  • Yunfeng Bian
  • Fangyue Chen
  • Yi Wang
  • Jing Chen
  • Wei Chen
چکیده

In this paper, the dynamics of elementary cellular automaton rule 41 is investigated in the bi-infinite symbolic sequence space. In spite of rule 41 is not surjective, but it possess of rich and complex dynamical behaviors. The existence of attractors and subshifts of finite type of the rule’s global map is strictly proved, some interesting dynamical properties on these subshifts, such as positive topological entropies, topological transitivity and topological mixing, chaos in the sense of Li-Yorke and Devaney, are revealed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cellular Automata with an Infinite Number of Subshift Attractors

The concept of an attractor is essential for understanding the dynamics of cellular automata. An attractor is defined as a limit set (intersection of forward images) of a nonempty clopen (closed and open) invariant set. Classification of cellular automata based on the system of their attractors has been considered in Hurley [1] or Kůrka [2]. The basic distinction is between cellular automata wh...

متن کامل

The Williams Conjecture Is False for Irreducible Subshifts

We prove that the Williams conjecture is false for irreducible subshifts of finite type using relative sign-gyration numbers defined between different subshifts.

متن کامل

Subshifts of Quasi-Finite Type

We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise monotonic maps of the interval with positive entropy. Yet many properties remain: existence of finitely many ergodic invariant probabilities of maximum entropy;...

متن کامل

On the Density of Periodic Configurations in Strongly Irreducible Subshifts

Let G be a residually finite group and let A be a finite set. We prove that if X ⊂ A is a strongly irreducible subshift of finite type containing a periodic configuration then periodic configurations are dense in X. The density of periodic configurations implies in particular that every injective endomorphism of X is surjective and that the group of automorphisms of X is residually finite. We a...

متن کامل

Subshifts and Logic: Back and Forth

We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings, and of universal sentences in terms of combinations of “pattern counting” subshifts. Conversely, we characterise logic fragments corresponding to various clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011